RELATIVELY COHERENT SETS AS A HIERARCHICAL PARTITION METHOD

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relatively Coherent Sets as a Hierarchical Partition Method

Finite time coherent sets [Froyland et al., 2010] have recently been defined by a measure-based objective function describing the degree that sets hold together, along with a Frobenius–Perron transfer operator method to produce optimally coherent sets. Here, we present an extension to generalize the concept to hierarchically define relatively coherent sets based on adjusting the finite time coh...

متن کامل

On Relatively Prime Sets

Functions counting the number of subsets of {1, 2, . . . , n} having particular properties are defined by Nathanson. Here, generalizations in two directions are given. Received: 10/1/08, Revised: 3/20/09, Accepted: 3/30/09

متن کامل

A Particle-Partition of Unity Method Part VIII: Hierarchical Enrichment

This paper is concerned with automatic enrichment in the particlepartition of unity method (PPUM). The goal of our automatic enrichment is to recover the optimal convergence rate of the uniform h-version independent of the regularity of the solution. Hence, we employ enrichment not only for modeling purposes but rather to improve the approximation properties of the numerical scheme. To this end...

متن کامل

On Relatively Prime Sets Counting Functions

This work is motivated by Nathanson’s recent paper on relatively prime sets and a phi function for subsets of {1, 2, 3, . . . , n}. We establish enumeration formulas for the number of relatively prime subsets and the number of relatively prime subsets of cardinality k of {1, 2, 3, . . . , n} under various constraints. Further, we show how this work links up with the study of multicompositions. ...

متن کامل

Join-semidistributive Lattices of Relatively Convex Sets

We give two sufficient conditions for the lattice Co(Rn, X) of relatively convex sets of Rn to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice can be embedded into Co(Rn, X), for a suitable finite subset X of Rn.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Bifurcation and Chaos

سال: 2013

ISSN: 0218-1274,1793-6551

DOI: 10.1142/s0218127413300267